Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree
نویسندگان
چکیده
منابع مشابه
Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree
An (I,Fd)-partition of a graph is a partition of the vertices of the graph into two sets I and F , such that I is an independent set and F induces a forest of maximum degree at most d. We show that for all M < 3 and d ≥ 2 3−M − 2, if a graph has maximum average degree less than M , then it has an (I,Fd)-partition. Additionally, we prove that for all 8 3 ≤ M < 3 and d ≥ 1 3−M , if a graph has ma...
متن کاملPartitioning a triangle-free planar graph into a forest and a forest of bounded degree
An (F , Fd)-partition of a graph is a vertex-partition into two sets F and Fd such that the graph induced by F is a forest and the one induced by Fd is a forest with maximum degree at most d. We prove that every triangle-free planar graph admits an (F , F5)-partition. Moreover we show that if for some integer d there exists a trianglefree planar graph that does not admit an (F , Fd)-partition, ...
متن کاملImproved Approximations of Independent Dominating Set in Bounded Degree Graphs
We consider the problem of nding an independent dominating set of minimum cardinality in bounded degree and regular graphs. We rst give an approximation algorithm for at most cubic graphs, that achieves ratio 2, based on greedy and local search techniques. We then propose an heuristic based on an iterative application of the greedy technique on graphs of lower and lower degree. When the graph i...
متن کاملSparse universal graphs for bounded-degree graphs
Let H be a family of graphs. A graph T is H-universal if it contains a copy of each H ∈ H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum degree at most k. For all positive integers k and n, we construct an H(k, n)-universal graph T with Ok(n 2 k log 4 k n) edges and exactly n vertices. The number of edges is almost as small as possible, as Ω(n2−2/k) is a lower...
متن کاملSparse Partition Universal Graphs for Graphs of Bounded Degree
In 1983, Chvátal, Trotter and the two senior authors proved that for any ∆ there exists B so that, for any n, any 2-coloring of the edges of the complete graph KN with N ≥ Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree ∆. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N2−1/∆ log N) edges, with N = bB...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/6815